Inverses of Multivariate Polynomial Matrices using Discrete Convolution
نویسندگان
چکیده
A new method for inversion of rectangular matrices in a multivariate polynomial ring with coefficients in a field is explained. This method requires that the polynomial matrix satisfies the one-to-one mapping criteria defined in [1].
منابع مشابه
TR-2011004: Acceleration of Newton's Polynomial Factorization: Army of Constraints, Convolution, Sylvester Matrices, and Partial Fraction Decomposition
We try to arm Newton’s iteration for univariate polynomial factorization with greater convergence power by shifting to a larger basic system of multivariate constraints. The convolution equation is a natural means for a desired expansion of the basis for this iteration versus the classical univariate method, which is more vulnerable to foreign distractions from its convergence course. Compared ...
متن کاملAcceleration of Newton’s Polynomial Factorization: Army of Constraints, Convolution, Sylvester Matrices, and Partial Fraction Decomposition
We try to arm Newton’s iteration for univariate polynomial factorization with greater convergence power by shifting to a larger basic system of multivariate constraints. The convolution equation is a natural means for a desired expansion of the basis for this iteration versus the classical univariate method, which is more vulnerable to foreign distractions from its convergence course. Compared ...
متن کاملGeneralized Pascal Matrices and Inverses Using One-to-One Rational Polynomial s-z Transformations
Abstract: This paper proposes a one-to-one mapping between the coefficients of continuous-time (s-domain) and discrete-time (z-domain) IIR transfer functions such that the s-domain numerator/denominator coefficients can be uniquely mapped to the z-domain numerator/denominator coefficients, and vice versa. The one-to-one mapping provides a firm basis for proving the inverses of the so-called gen...
متن کاملA study on new right/left inverses of nonsquare polynomial matrices
This paper presents several new results on the inversion of full normal rank nonsquare polynomial matrices. New analytical right/left inverses of polynomial matrices are introduced, including the so-called τ -inverses, σ-inverses and, in particular, S-inverses, the latter providing the most general tool for the design of various polynomial matrix inverses. The applicationoriented problem of sel...
متن کاملMultivariate Fuss-Narayana Polynomials and their Application to Random Matrices
It has been shown recently that the limit moments of W (n) = B(n)B∗(n), where B(n) is a product of p independent rectangular random matrices, are certain homogeneous polynomials Pk(d0, d1, . . . , dp) in the asymptotic dimensions of these matrices. Using the combinatorics of noncrossing partitions, we explicitly determine these polynomials and show that they are closely related to polynomials w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004